numerically stable algorithm

См. также в других словарях:

• Stable algorithm — * In computer science, a stable sorting algorithm is a sorting algorithm that preserves the order of records with equal keys. * In numerical analysis, a numerically stable algorithm is an algorithm that is numerically stable …   Wikipedia

• De Boor's algorithm — In the mathematical subfield of numerical analysis the de Boor s algorithm is a fast and numerically stable algorithm for evaluating spline curves in B spline form. It is a generalization of the de Casteljau s algorithm for Bézier curves. The… …   Wikipedia

• Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… …   Wikipedia

• Integer relation algorithm — An integer relation between a set of real numbers x 1, x 2, ..., x n is a set of integers a 1, a 2, ..., a n, not all 0, such that:a 1x 1 + a 2x 2 + cdots + a nx n = 0.,An integer relation algorithm is an algorithm for finding integer relations.… …   Wikipedia

• QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… …   Wikipedia

• De Casteljau's algorithm — In the mathematical field of numerical analysis, De Casteljau s algorithm is a recursive method to evaluate polynomials in Bernstein form or Bézier curves, named after its inventor Paul de Casteljau. De Casteljau s algorithm can also be used to… …   Wikipedia

• Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix …   Wikipedia

• Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… …   Wikipedia

• Algorithms for calculating variance — play a major role in statistical computing. A key problem in the design of good algorithms for this problem is that formulas for the variance may involve sums of squares, which can lead to numerical instability as well as to arithmetic overflow… …   Wikipedia

• De Boor — may refer to: Carl R. de Boor (born 1937), German American mathematician and professor emeritus De Boor s algorithm, a fast and numerically stable algorithm for evaluating spline curves in B spline form Carl Gotthard de Boor (1848–1923), German… …   Wikipedia

• List of atmospheric radiative transfer codes — this article contains list of atmospheric radiative transfer codes and their applications.ClassificationThe compilation contains information about the atmospheric radiative transfer, relevant databases, and atmospheric radiation parameterizations …   Wikipedia